Frequency Computation and Bounded Queries
نویسندگان
چکیده
There have been several papers over the last ten years that consider the number of queries needed to compute a function as a measure of its complexity. The following function has been studied extensively in that light: Ft(xl,. . .,x0) = ,4(x,). .A(x,). We are interested in the complexity (in terms of the number of queries) of approximating Fi. Let b <a and let f be any function such that Ft(xl, . ,x0) and f(x1,. . .,x0) agree on at least b bits. For a general set A we have matching upper and lower bounds on f that depend on coding theory. These are applied to get exact bounds for the case where A is semirecursive, A is superterse, and (assuming P # NP) A = SAT. We obtain exact bounds when A is the halting problem using different methods.
منابع مشابه
The Power of Frequency Computation
The notion of frequency computation concerns approxima-tive computations of n distinct parallel queries to a set A. A is called (m; n)-recursive if there is an algorithm which answers any n distinct parallel queries to A such that at least m answers are correct. This paper gives natural combinatorial characterizations of the fundamental inclusion problem, namely the question for which choices o...
متن کاملBalanced Queries: Divide and Conquer
We define a new hypergraph decomposition method called Balanced Decomposition and associate Balanced Width to hypergraphs and queries. We compare this new method to other well known decomposition methods, and analyze the complexity of finding balanced decompositions of bounded width and the complexity of answering queries of bounded width. To this purpose we define a new complexity class, allow...
متن کاملFr{'e}chet and Hausdorff Queries on $x$-Monotone Trajectories
vspace{0.2cm}In this paper, we design a data structure for the following problem. Let $pi$ be an $x$-monotone trajectory with $n$ vertices in the plane and $epsilon >0$. We show how to preprocess $pi$ and $epsilon$ into a data structure such that for any horizontal query segment $Q$ in the plane, one can quickly determine the minimal continuous fraction of $pi$ whose Fr{'e}chet and Hausdo...
متن کاملA Method for Protecting Access Pattern in Outsourced Data
Protecting the information access pattern, which means preventing the disclosure of data and structural details of databases, is very important in working with data, especially in the cases of outsourced databases and databases with Internet access. The protection of the information access pattern indicates that mere data confidentiality is not sufficient and the privacy of queries and accesses...
متن کاملLoad-Frequency Control: a GA based Bayesian Networks Multi-agent System
Bayesian Networks (BN) provides a robust probabilistic method of reasoning under uncertainty. They have been successfully applied in a variety of real-world tasks but they have received little attention in the area of load-frequency control (LFC). In practice, LFC systems use proportional-integral controllers. However since these controllers are designed using a linear model, the nonlinearities...
متن کاملOptimal Quantum Algorithm for Polynomial Interpolation
We consider the number of quantum queries required to determine the coefficients of a degree-d polynomial over Fq. A lower bound shown independently by Kane and Kutin and by Meyer and Pommersheim shows that d/2 + 1/2 quantum queries are needed to solve this problem with bounded error, whereas an algorithm of Boneh and Zhandry shows that d quantum queries are sufficient. We show that the lower b...
متن کامل